Darboux integrating factors: Inverse problems
نویسندگان
چکیده
منابع مشابه
Morphisms and Inverse Problems for Darboux Integrating Factors
Polynomial vector fields which admit a prescribed Darboux integrating factor are quite well-understood when the geometry of the underlying curve is nondegenerate. In the general setting morphisms of the affine plane may remove degeneracies of the curve, and thus allow more structural insight. In the present paper we establish some properties of integrating factors subjected to morphisms, and we...
متن کاملInverse Problems in Darboux’ Theory of Integrability
The Darboux theory of integrability for planar polynomial differential equations is a classical field, with connections to Lie symmetries, differential algebra and other areas of mathematics. In the present paper we introduce the concepts, problems and inverse problems, and we outline some recent results on inverse problems. We also prove a new result, viz. a general finiteness theorem for the ...
متن کاملSingular matrix Darboux transformations in the inverse-scattering method
Singular Darboux transformations, in contrast to the conventional ones, have a singular matrix as a coefficient before the derivative. We incorporated such transformations into a chain of conventional transformations and presented determinant formulas for the resulting action of the chain. A determinant representation of the Kohlhoff–von Geramb solution to the Marchenko equation is given. PACS ...
متن کاملIll-Posed and Linear Inverse Problems
In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.
متن کاملInverse Problems Have Inverse Complexity
In this paper we show that inverting problems of higher complexity is easier than inverting problems of lower complexity. While inverting Σ i 3CNFSAT is known to be coNP-complete [6] for i = 1 we prove that it remains coNP-complete for i = 2 and is in P for all i ≥ 3. Relatedly, we show that inverting Σ i 3DNFSAT is in P for all i ≥ 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Equations
سال: 2011
ISSN: 0022-0396
DOI: 10.1016/j.jde.2010.10.013